General iteration and unary functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unary functions

We consider F , the class of …nite unary functions, i.e. the class of pairs of the form (A; f) where A is a …nite set and f is an unary function on A. We also consider two subclasses of F : B and Fk for k > 1. B contains structures (A; f) with the property that f is a bijection of the set A, and Fk contains structures (A; f) with the property that inverse image of every point in A under f has c...

متن کامل

Unary Primitive Recursive Functions

In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §

متن کامل

Optimization with unary functions

Most nonlinear programming problems consist of functions which are sums of unary functions of linear functions. Advantage can be taken of this form to calculate second and higher order derivatives easily and at little cost. Using these, high order optimization techniques such as Halley's method can be utilized to accelerate the rate of convergence to the solution. These higher order derivatives...

متن کامل

On Bijections vs. Unary Functions

A set of nite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quan-tiication is over relations of arity 2. In DLS95] subclasses of Binary NP were considered, in which the second order quantiiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in ...

متن کامل

Clones containing all almost unary functions

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1991

ISSN: 0168-0072

DOI: 10.1016/0168-0072(91)90029-l